import sys

data = sys.stdin.readlines()
#data = ["32327"]

def read_data(data):
    return int(data[0])

def get_primes(num):
    primes = [1] * (num + 2)
    primes[0] = 0
    primes[1] = 0
    current = 2;
    while current < num:
        while primes[current] == 0:
            current = current + 1
        for j in range(current + current, num + 1, current):
            primes[j] = 0
        current = current + 1
    result = []
    for i in range(2, num + 1):
        if(primes[i] == 1):
            result.append(i)
    return result

def count_p(num, p):
    ret = 0;
    while(num % p == 0):
        ret = ret + 1
        num = num // p
    return ret
    
num = read_data(data);

primes =get_primes(num)

prime_factor_count = [0] * len(primes)

for i in range(0,len(primes)):
    prime = primes[i]
    for k in range(prime, num + 1, prime):
        prime_factor_count[i] = prime_factor_count[i] + count_p(k, prime)

total_combinations = 1
for i in prime_factor_count:
    total_combinations = total_combinations * (i*2 + 1)
    if(total_combinations > 1000007):
        total_combinations = total_combinations % 1000007

print(total_combinations % 1000007)

